Forbidden subgraphs for hamiltonicity of 1-tough graphs
نویسندگان
چکیده
A graph G is said to be 1-tough if for every vertex cut S of G, the number of components of G − S does not exceed |S|. Being 1-tough is an obvious necessary condition for a graph to be hamiltonian, but it is not sufficient in general. We study the problem of characterizing all graphs H such that every 1-tough H-free graph is hamiltonian. We almost obtain a complete solution to this problem, leaving H = K1 ∪ P4 as the only open case.
منابع مشابه
Forbidden Subgraphs for Hamiltonicity of 3-Connected Claw-Free Graphs
In this paper, we consider forbidden subgraphs for hamiltonicity of 3-connected claw-free graphs. Let Zi be the graph obtaind from a triangle by attaching a path of length i to one of its vertices, and let Q∗ be the graph obtained from the Petersen graph by adding one pendant edge to each vertex. Lai et al. [J. Graph Theory 64 (2010), no. 1, 1-11] conjectured that every 3-connected {K1,3, Z9}-f...
متن کاملForbidden subgraphs, stability and hamiltonicity
We study the stability of some classes of claw-free graphs deened in terms of forbidden subgraphs under the closure operation deened in 10]. We characterize all connected graphs A such that the class of all CA-free graphs (where C denotes the claw) is stable. Using this result, we prove that every 2-connected and CHP 8-free, CHZ 5-free or CHN 1;1;4-free graph is either hamiltonian or belongs to...
متن کاملHamiltonicity and forbidden subgraphs in 4-connected graphs
Let T be the line graph of the unique tree F on 8 vertices with degree sequence (3, 3, 3, 1, 1, 1, 1, 1), i.e. T is a chain of three triangles. We show that every 4-connected {T,K1,3}-free graph has a hamiltonian cycle.
متن کاملClaw-free graphs - A survey
In this paper we summarize known results on claw-free graphs. The paper is subdivided into the following chapters and sections: 1. Introduction 2. Paths, cycles, hamiltonicity a) Preliminaries b) Degree and neighborhood conditions c) Local connectivity conditions d) Further forbidden subgraphs e) Invariants f) Squares g) Regular graphs h) Other hamiltonicity related results and generalizations ...
متن کاملForbidden subgraphs and the existence of a 2-factor
For a connected graph H, a graph G is said to be H-free if G does not contain an induced subgraph which is isomorphic to H, and for a set of connected graphs H, G is said to be H-free if G is H-free for every H ∈ H. The set H is called a forbidden subgraph. In particular, if |H| = 2 (resp. |H| = 3), we often call H a forbidden pair (resp. forbidden triple). In 1991, Bedrossian proved that there...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 36 شماره
صفحات -
تاریخ انتشار 2016